An Upper Bound on Overflow Probability in Transient Source Systems
نویسندگان
چکیده
In this paper we consider a single buffer fluid model where sources arrive according to a Poisson process, and stay in the system for independent and identically distributed (iid) exponential amounts of time and then depart. While they are in the system, they generate fluid traffic that is modulated by iid finite state continuous time Markov chains (CTMC). The fluid in the buffer is drained at a constant rate. We study stability of the buffer content process, and then derive an exponential upper bound for the tail of the buffer content process in steady state. The results have applications in design and operation of ATM switches: we use them to develop call admission policies, and also for capacity design. Numerical results are presented to demonstrate the methodology. ∗Air Force Institute of Technology †University of North Carolina at Chapel Hill
منابع مشابه
Traffic conditioner: upper bound for the spacer overflow probability
The current challenge for telecommunication networks is to offer new types of services. To achieve this, somehow traffic has to be conditioned. A spacer is a token bucket traffic conditioner that reshapes flows according to a periodic profile. Packets are delayed until they can be inserted according to this profile. This short paper concentrates on packet discard by overflow in the spacer. An u...
متن کاملSelf-Similar Traffic and Upper Bounds to Buffer-Overflow Probability in an ATM Queue
From real measurements in high-speed communications networks, it was recently shown that network traffic may demonstrate properties of long-range dependency peculiar to the self-similar stochastic process. It was also shown by measurements that with increasing buffer capacity, the resulting cell loss is not reduced exponentially fast, as it is predicted by queueing theory applied to traditional...
متن کاملWeapon scheduling in naval combat systems for maximization of defense capabilities
Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an in...
متن کاملEstimation of Buffer Overflow Probabilities and Economies of Scale in ATM Multiplexers by Analysis of a Model of Packetized Voice Traffic
Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM M ultiplexers by Analysis of a M odel of Packetized Voice Traffic by Paul J. Farrell We obtain upper bounds on the probability of buffer overflow for an ATM multiplexer of L identical packetized voice sources The multiplexer is modelled by a FCFS single server queue The arrivals at the multiplexer are a homogenous superpo...
متن کاملAdvances in Applied Probability ON THE ASYMPTOTIC RELATIONSHIP BETWEEN THE OVERFLOW PROB- ABILITY AND THE LOSS RATIO
In this paper we study the asymptotic relationship between the loss ratio in a finite buffer system and the overflow probability (the tail of the queue length distribution) in the corresponding infinite buffer system. We model the system by a fluid queue which consists of a server with constant rate c and a fluid input. We provide asymptotic upper and lower bounds on the difference between log ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005